package net.sf.graph4j.datastructure.disjointset;



/**
 * 
 */

/**
 * A disjoint-set data structure maintains a collection of disjoint dynamic
 * sets. Each set is identified by a representative, which is some member of the
 * set. In some applications, it doesn't matter which member is used as the
 * representative; we only care that if we ask for the representative of a
 * dynamic set twice without modifying the set between the requests, we get the
 * same answer both times. In other applications, there may be a prespecified
 * rule for choosing the representative, such as choosing the smallest member in
 * the set (assuming, of course, that the elements can be ordered).
 * 
 * @author chen cong
 * 
 */
public interface IDisjointSet<E> {

}
